1323F - Reality Show - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;

const int MAX = 4005;
 
int N, M;
vector<int> aggressive, recruit;
vector<int> profit;
 
int dp[MAX][MAX];
vector<int> max_count;
 
int compute_extra(int agg, int count, int limit = MAX) {
    int extra = 0;
 
    while (count > 1 && agg < limit) {
        count /= 2;
        agg++;
        extra += count * profit[agg];
    }
 
    return extra;
}

void solve() {
    cin >> N >> M;
    aggressive.resize(N);
    recruit.resize(N);
    profit.assign(N+M+1, 0);

    for (int &a : aggressive) {
        cin >> a;
    }

    for (int &r : recruit) {
        cin >> r;
    }
 
    for (int i = 1; i <= N + M; i++)
        cin >> profit[i];
 
    max_count.assign(N + M + 1, 0);
    memset(dp, -63, sizeof(dp));
    dp[0][0] = 0;

    for (int i = N - 1; i >= 0; i--) {
        int agg = aggressive[i];

        for (int a = agg; a >= 0; a--) {
            for (int c = max_count[a]; c >= 0; c--) {
                int extra = compute_extra(a, c, agg);
                int c_to_agg = c >> min(agg - a, 30);
                dp[agg][c_to_agg + 1] = max(dp[agg][c_to_agg + 1], dp[a][c] + extra + profit[agg] - recruit[i]);
                max_count[agg] = max(max_count[agg], c_to_agg + 1);
            }
        }
    }

    int ans = 0;
    for (int a = 0; a <= N+M; a++) {
        for (int c = 0; c <= max_count[a]; c++) {
            ans = max(ans, dp[a][c] + compute_extra(a, c));
        }
    }

    cout << ans << '\n';
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}